Matrix Polynomials with Completely Prescribed Eigenstructure
نویسندگان
چکیده
We present necessary and sufficient conditions for the existence of a matrix polynomial when its degree, its finite and infinite elementary divisors, and its left and right minimal indices are prescribed. These conditions hold for arbitrary infinite fields and are determined mainly by the “index sum theorem”, which is a fundamental relationship between the rank, the degree, the sum of all partial multiplicities, and the sum of all minimal indices of any matrix polynomial. The proof developed for the existence of such polynomial is constructive and, therefore, solves a very general inverse problem for matrix polynomials with prescribed complete eigenstructure. This result allows us to fix the problem of the existence of `ifications of a given matrix polynomial, as well as to determine all their possible sizes and eigenstructures.
منابع مشابه
On Inverse Quadratic Eigenvalue Problems with Partially Prescribed Eigenstructure
The inverse eigenvalue problem of constructing real and symmetric square matrices M , C, and K of size n × n for the quadratic pencil Q(λ) = λ2M + λC + K so that Q(λ) has a prescribed subset of eigenvalues and eigenvectors is considered. This paper consists of two parts addressing two related but different problems. The first part deals with the inverse problem where M and K are required to be ...
متن کاملStructured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...
متن کاملOn the Eigenstructure of Hermitian Toeplitz Matrices with Prescribed Eigenpairs
Toeplitz matrices have found important applications in bioinformatics and computational biology [5, 6, 11, 12]. In this paper we concern the spectral properties of hermitian Toeplitz matrices. Based on the fact that every centrohermitian matrix can be reduced to a real matrix by a simple similarity transformation, we first consider the eigenstructure of hermitian Toeplitz matrices and then disc...
متن کاملThe reconstruction of an hermitian toeplitz matrix with prescribed eigenpairs
Toeplitz matrices have been found important applications in bioinformatics and computational biology [5-9, 11-12]. In this paper we concern the reconstruction of an hermitian Toeplitz matrices with prescribed eigenpairs. Based on the fact that every centrohermitian matrix can be reduced to a real matrix by a simple similarity transformation, we first consider the eigenstructure of hermitian Toe...
متن کاملEla the Behaviour of the Complete Eigenstructure of a Polynomial Matrix under a Generic Rational Transformation
Given a polynomial matrix P (x) of grade g and a rational function x(y) = n(y)/d(y), where n(y) and d(y) are coprime nonzero scalar polynomials, the polynomial matrix Q(y) := [d(y)]P (x(y)) is defined. The complete eigenstructures of P (x) and Q(y) are related, including characteristic values, elementary divisors and minimal indices. A theorem on the matter, valid in the most general hypotheses...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 36 شماره
صفحات -
تاریخ انتشار 2015